Resistance of Isogeny-Based Cryptographic Implementations to a Fault Attack

نویسندگان

چکیده

The threat of quantum computers has sparked the development a new kind cryptography to resist their attacks. Isogenies between elliptic curves are one tools used for such cryptosystems. They championed by SIKE (Supersingular isogeny key encapsulation), an alternate candidate third round NIST Post-Quantum Cryptography Standardization Process. While all candidates believed be mathematically secure, implementations may vulnerable hardware In this work we investigate first time whether Ti's 2017 theoretical fault injection attack is exploitable in practice. We also examine suitable countermeasures. manage recover secret thanks electromagnetic on ARM Cortex A53 using correct and altered public generation. Moreover propose countermeasure detect faults that low overhead as it takes advantage redundancy already present implementations.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fault Attack on Supersingular Isogeny Cryptosystems

We present the first fault attack on cryptosystems based on supersingular isogenies. During the computation of the auxiliary points, the attack aims to change the base point to a random point on the curve via a fault injection. We will show that this would reveal the secret isogeny with one successful perturbation with high probability. We will exhibit the attack by placing it against signature...

متن کامل

Synthesis of Fault-Attack Countermeasures for Cryptographic Circuits

Fault sensitivity analysis (FSA) is a side-channel attack method that injects faults to cryptographic circuits through clock glitching and applies statistical analysis to deduce sensitive data such as the cryptographic key. It exploits the correlation between the circuit’s signal path delays and sensitive data. A countermeasure, in this case, is an alternative implementation of the circuit wher...

متن کامل

Robust Codes for Fault Attack Resistant Cryptographic Hardware

Hardware implementations of cryptographic algorithms are vulnerable to fault analysis attacks. To detect these attacks we propose an architecture based on robust nonlinear systematic (n,k)-error-detecting codes. These nonlinear codes offer advantages over linear codes since they are capable of providing uniform error detecting coverage independently of the error distributions. They make no assu...

متن کامل

Fault Attack Resistant Cryptographic Hardware with Uniform Error Detection

Traditional hardware error detection methods based on linear codes make assumptions about the typical or expected errors and faults and concentrate the detection power towards the expected errors and faults. These traditional methods are not optimal for the protection of hardware implementations of cryptographic hardware against fault attacks. An adversary performing a fault-based attack can be...

متن کامل

A Practical Attack on a Braid Group Based Cryptographic Protocol

In this paper we present a practical heuristic attack on the Ko, Lee et al. key exchange protocol introduced at Crypto 2000 [10]. One of the ideas behind our attack is using Dehornoy’s handle reduction method as a counter measure to diffusion provided by the Garside normal form, and as a tool for simplifying braid words. Another idea employed in our attack is solving the decomposition problem i...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Lecture Notes in Computer Science

سال: 2021

ISSN: ['1611-3349', '0302-9743']

DOI: https://doi.org/10.1007/978-3-030-89915-8_12